On multi F-nomial coefficients and Inversion formula for F-nomial coefficients
نویسنده
چکیده
In response to [7], we discover the looked for inversion formula for F -nomial coefficients. Before supplying its proof, we generalize F -nomial coefficients to multi F -nomial coefficients and we give their combinatorial interpretation in cobweb posets language, as the number of maximal-disjoint blocks of the form σPk1,k2,...,ks of layer 〈Φ1 → Φn〉. Then we present inversion formula for F -nomial coefficients using multi F-nomial coefficients for all cobwebadmissible sequences. To this end we infer also some identities as conclusions of that inversion formula for the case of binomial, Gaussian and Fibonomial coefficients.
منابع مشابه
On multi F-nomial coefficients
In response to [6], we discover the looked for inversion formula for F -nomial coefficients. Before supplying its proof, we generalize F -nomial coefficients to multi F -nomial coefficients and we give their combinatorial interpretation in cobweb posets language, as the number of maximal-disjoint blocks of the form σPk1,k2,...,ks of layer 〈Φ1 → Φn〉. Then we present inversion formula for F -nomi...
متن کاملCounting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
Abstract F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(α) are considered. For such specific sequences a new interpretation with respect to Kwaśniewski general combinatorial interpretation of F -nomial coeffic...
متن کاملGeneralization of Fibonomial Coefficients
Following Lucas and then other Fibonacci people Kwaśniewski had introduced and had started ten years ago the open investigation of the overall F -nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb posets’ partitions and tilings of discrete hyperboxes. In this paper, we deal ...
متن کاملOn Cobweb Posets and Discrete F-Boxes Tilings
Abstract F -boxes defined in [6] as hyper-boxes in N∞ discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F -boxes edges sizes are taken to be values of terms of natural numbers’ valued sequence F . The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F -ti...
متن کاملOn the spacings between C-nomial coefficients
Let (Cn)n≥0 be the Lucas sequence Cn+2 = aCn+1 +bCn for all n ≥ 0, where C0 = 0 and C1 = 1. For 1 ≤ k ≤ m− 1 let [ m k ] C = CmCm−1 · · ·Cm−k+1 C1 · · ·Ck be the corresponding C-nomial coefficient. When Cn = Fn is the Fibonacci sequence (the numbers [ m k ] F are called Fibonomials), or Cn = (qn − 1)/(q − 1), where q > 1 is an integer (the numbers [ m k ] q are called q-binomial, or Gaussian co...
متن کامل